With Finite Memory Consensus Is Easier Than Reliable Broadcast
نویسندگان
چکیده
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than reliable broadcast, and that reliable broadcast is as difficult to solve as repeated consensus: More precisely, with finite memory, consensus can be solved with failure detector S , and P− (a variant of the perfect failure detector which is stronger than S) is necessary and sufficient to solve reliable broadcast and repeated consensus.
منابع مشابه
Consensus is Easier Than Reliable Broadcast
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than reliable broadcast, and that reliable broadcast is as difficult to solve as repeated consensus: More pre...
متن کاملShared Memory vs Message Passing
This paper determines the computational strength of the shared memory abstraction (a register) emulated over a message passing system, and compares it with fundamental message passing abstractions like consensus and various forms of reliable broadcast. We introduce the notion of Quorum failure detectors and show that this notion captures the exact amount of information about failures needed to ...
متن کاملOn Reliable Broadcast in a Radio Network: A Simplified Characterization
We consider the problem of reliable broadcast in an infinite (or finite toroidal) radio network under Byzantine and crash-stop failures. We present a simpler characterization and proofs for results proved earlier in [1].
متن کاملImplementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
When implementing multivalued consensus using binary consensus, previous algorithms assume the availability of uniform reliable broadcast, which is not implementable in systems with fair-lossy links. In this paper, we show that with binary consensus we can implement uniform reliable broadcast directly in systems with fair-lossy links, and thus the separate assumption of the availability of unif...
متن کاملA Realistic Look At Failure Detectors
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure detectors) to solve fundamental agreement problems like uniform consensus, atomic broadcast, and terminating reliable broadcast (also called Byzantine Generals). Roughly speaking, in this environment, we collapse the Chan...
متن کامل